A propositional logic with 4 values: true, false, divergent and meaningless
نویسندگان
چکیده
In this paper, we survey 3-valued logics and their complete axiomatizations, one of which is new. We then propose a 4-valued, functionally complete logic that incorporates these 3-valued systems and provide notations for interesting operators and subsystems.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملEecient Algorithms for Classes of the Futile Questioning Problem
De ne the following problem to be the futile questioning problem of propositional logic. The input consists of two propositional logic formulas S and T . Some variables of S are declared to be question variables. One either must assign True/False values to the question variables of S such that T becomes a theorem of the modi ed S, or must conclude that no such assignment of True/False values is...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملA Calculus for Sequential Logic with 4 Values
This note presents a complete axiomatisation for four-valued sequential logic. `Sequential' means that arguments are evaluated from left to right, until an answer can be obtained. Three-valued sequential logic is due to McCarthy [6]. In [1] four truth-values are introduced: true, false, mistake and divergent. Several four-valued logics arise by restricting the set of connectives. In the nomencl...
متن کاملReasoning with Finite Set Constraints
The language of propositional logic is sometimes not appropriate to model real-world problems. Therefore, finite set constraints are introduced. A variable of a finite set constraint takes exactly one value out of a given set of values whereas a propositional variable is either true or false. Although the class of real-world problems which can be described using the language of propositional lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 5 شماره
صفحات -
تاریخ انتشار 1995